Static versus dynamic heterogeneous parallel schemes to solve the symmetric tridiagonal eigenvalue problem
نویسندگان
چکیده
Computation of the eigenvalues of a symmetric tridiagonal matrix is a problem of great relevance. Many linear algebra libraries provide subroutines for solving it. But none of them is oriented to be executed in heterogeneous distributed memory multicomputers. In this work we focus on this kind of platforms. Two different load balancing schemes are presented and implemented. The experimental results show that only the algorithms that take into account the heterogeneity of the system when balancing the workload obtain optimum performance. This fact justifies the need of implementing specific load balancing techniques for heterogeneous parallel computers. Key–Words: Symmetric tridiagonal eigenvalue problem, heterogeneous parallel computing, load balancing
منابع مشابه
A Parallel Eigensolver for Dense Symmetric Matrices*
We describe a parallel algorithm for finding the eigenvalues and eigenvectors of a dense symmetric matrix. We follow the traditional three step process: we reduce the dense matrix to tridiagonal form, solve the tridiagonal problem then backtransform the result. Since the different steps have different algorithmic characteristics, this problem serves as an perfect vehicle for exploring some issu...
متن کاملA PARALLEL ALGORITHM FOR THE REDUCTION TO TRIDIAGONAL FORM FOR EIGENDECOMPOSITIONy
A new algorithm for the orthogonal reduction of a symmetric matrix to tridiagonal form is developed and analysed. It uses a Cholesky factorization of the original matrix and the rotations are applied to the factors. The idea is similar to the one used for the one-sided Jacobi algorithms B. The algorithm uses little communication , accesses data with stride one and is to a large extent independe...
متن کاملThe inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices
In this paper we construct the symmetric quasi anti-bidiagonal matrix that its eigenvalues are given, and show that the problem is also equivalent to the inverse eigenvalue problem for a certain symmetric tridiagonal matrix which has the same eigenvalues. Not only elements of the tridiagonal matrix come from quasi anti-bidiagonal matrix, but also the places of elements exchange based on some co...
متن کاملTridiagonalization of a symmetric matrix on a square array of mesh-connected processors
A parallel algorithm for transforming an n × n symmetric matrix to tridiagonal form is described. The algorithm implements Givens rotations on a square array of n × n processors in such a way that the transformation can be performed in time O(n log n). The processors require only nearest-neighbor communication. The reduction to tridiagonal form could be the first step in the parallel solution o...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کامل